Minimal Representations of Order Types by Geometric Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Geometric Graph Representations of Order Types∗

We consider the problem of characterizing small geometric graphs whose structure uniquely determines the order type of its vertex set. We describe a set of edges that prevent the order type from changing by continuous movement and identify properties of the resulting graphs.

متن کامل

Geometric Representations of Graphs

The study of geometrically defined graphs, and of the reverse question, the construction of geometric representations of graphs, leads to unexpected connections between geometry and graph theory. We survey the surprisingly large variety of graph properties related to geometric representations, construction methods for geometric representations, and their applications in proofs and algorithms.

متن کامل

Minimal Euclidean representations of graphs

A simple graph G is representable in a real vector space of dimension m if there is an embedding of the vertex set in the vector space such that the Euclidean distance between any two vertices is one of only two distinct values a or b, with distance a if the vertices are adjacent and distance b otherwise. The Euclidean representation number of G is the smallest dimension in which G is represent...

متن کامل

Minimal representations, geometric quantization, and unitarity.

In the framework of geometric quantization we explicitly construct, in a uniform fashion, a unitary minimal representation pio of every simply-connected real Lie group Go such that the maximal compact subgroup of Go has finite center and Go admits some minimal representation. We obtain algebraic and analytic results about pio. We give several results on the algebraic and symplectic geometry of ...

متن کامل

Jamming and Geometric Representations of Graphs

We expose a relationship between jamming and a generalization of Tutte’s barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packing problems on two-dimensional surfaces.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Algorithms and Applications

سال: 2020

ISSN: 1526-1719

DOI: 10.7155/jgaa.00545